Fair throughput allocation in Information-Centric Networks

Fair Allocation in Evolving Networks

We consider networks evolving over time within an inÞnite-horizon dynamic setting. Transitions from one network to another are given by a stationary transition probability matrix. We study the problem of fairly and efficiently allocating the value of a network at any point in time among its participants, assuming that agents discount the future by some common discount factor δ. An allocation ru...

On the Throughput Capacity of Wireless Information-Centric Networks

Wireless information-centric networks consider storage one of the network primitives, and propose to cache data within the network in order to improve latency to access content and reduce bandwidth consumption. We study the throughput capacity of an information-centric network when the data cached in each node has a limited lifetime. The results show that with some fixed request and cache expir...

Proportional fair throughput allocation in multirate IEEE 802.11e wireless LANs

Under heterogeneous radio conditions, Wireless LAN stations may use different modulation schemes, leading to a heterogeneity of bit rates. In such a situation, 802.11 DCF allocates the same throughput to all stations independently of their transmitting bit rate; as a result, the channel is used by low bit rate stations most of the time, and efficiency is low. In this paper, we propose a more ef...

Fair resource allocation in active networks

Information-Centric Networks (ICN)

During the past decades, serious efforts have been made to propose various architectures for the future Internet. Each of those architectures has one thing in common, i.e., to focus on content delivery rather than on host-centric approaches. However, only few of them gained popularity due to their possible applications being investigated. In this chapter, we describe the overview of various fut...